Applying Constraint Weighting to Autonomous Camera Control

نویسندگان

  • Owen Bourne
  • Abdul Sattar
چکیده

Automating camera control for third-person perspective computer games is a difficult and time-consuming task. One of the challenges games developers confront is how to manage the trade-off between implementation complexity and system usability. In this study, we investigate the application of constraint weighting techniques to the autonomous camera control problem. We demonstrate that this technique can significantly simplify autonomous camera control and reduce the gap between implementation and usability requirements. We describe the use of weighting profiles to control the behaviour of the camera and specialized heuristics for efficiently searching for the solution. We also describe a novel integrated visibility maintenance method. As part of the experimental study, we implemented a 3D game engine that supports dynamic environments; and demonstrate the effectiveness of the use of constraint solving techniques for autonomous camera control problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Autonomous selection and modification of camera configurations using visibility and manipulability measures

In this article, we present a camera control method in which the selection of an optimal camera position and the modification of camera configurations are accomplished according to changes in the surroundings. For the autonomous selection and modification of camera configurations during tasks, we consider the camera’s visibility and the manipulator’s manipulability. The visibility constraint gu...

متن کامل

Dynamic Constraint Weighting for

Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be acceptable. Recent research has shown that constraint weighting local search algorithms can be very effective in solving a variety of CSPs. However, little work has been done in applying such algorithms to over-constrai...

متن کامل

Dynamic Constraint Weighting for Over-Constrained Problems

Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be acceptable. Recent research has shown that constraint weighting local search algorithms can be very effective in solving a variety of CSPs. However, little work has been done in applying such algorithms to over-constrai...

متن کامل

Constraint Weighting Local Search for Constraint Satisfaction

One of the challenges for the constraint satisfaction community has been to develop an automated approach to solving Constraint Satisfaction Problems (CSPs) rather than creating specific algorithms for specific problems. Much of this work has concentrated on the development and improvement of general purpose backtracking techniques. However, the success of relatively simple local search techniq...

متن کامل

Realtime Constraint Based Cinematography for Complex Interactive D Worlds

In D interactive ction systems a virtual camera must lm the behaviors of multiple autonomous characters as they unpredictably interact with one another are modi ed by the viewer and manip ulate artifacts in D worlds with complex scene geometries It must continuously plan camera movements to clearly shoot the salient visual fea tures of each relevant character To address these issues we have dev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005